38 research outputs found

    A compositional reliability and availability evaluation tool

    Get PDF

    Google-storing komt hard aan

    Get PDF
    Contains fulltext : 227511.pdf (publisher's version ) (Open Access)15 december 202

    Experiences with formal engineering: model-based specification, implementation and testing of a software bus at Neopost

    Get PDF
    We report on the actual industrial use of formal methods during the development of a software bus. During an internship at Neopost Inc., of 14 weeks, we developed the server component of a software bus, called the XBus, using formal methods during the design, validation and testing phase: we modeled our design of the XBus in the process algebra mCRL2, validated the design using the mCRL2-simulator, and fully automatically tested our implementation with the model-based test tool JTorX. This resulted in a well- tested software bus with a maintainable architecture. Writing the model (mdev), simulating it, and testing the implementation with JTorX only took 17% of the total development time. Moreover, the errors found with model-based testing would have been hard to find with conventional test methods. Thus, we show that formal engineering can be feasible, beneficial and cost-effective.\ud The findings above, reported earlier by us in (Sijtema et al., 2011) [1], were well- received, also in industrially oriented conferences (Ferreira and Romanenko, 2010) [2] and [3]. In this paper, we look back on the case study, and carefully analyze its merits and shortcomings. We reflect on (1) the added benefits of model checking, (2) model completeness and (3) the quality and performance of the test process.\ud Thus, in a second phase, after the internship, we model checked the XBus protocol—this was not done in [1] since the Neopost business process required a working implementation after 14 weeks. We used the CADP tool evaluator4 to check the behavioral requirements obtained during the development. Model checking did not uncover errors in model mdev, but revealed that model mdev was neither complete nor optimized: in particular, requirements to the so-called bad weather behavior (exceptions, unexpected inputs, etc.) were missing. Therefore, we created several improved models, checked that we could validate them, and used them to analyze quality and performance of the test process. Model checking was expensive: it took us approx. 4 weeks in total, compared to 3 weeks for the entire model-based testing approach during the internship.\ud In the second phase, we analyzed the quality and performance of the test process, where we looked at both code and model coverage. We found that high code coverage (almost 100%) is in most cases obtained within 1000 test steps and 2 minutes, which matches the fact that the faults in the XBus were discovered within a few minutes.\ud Summarizing, we firmly believe that the formal engineering approach is cost-effective, and produces high quality software products. Model checking does yield significantly better models, but is also costly. Thus, system developers should trade off higher model quality against higher costs

    Processes and their identifiers in synchronous network systems

    Get PDF
    Contains fulltext : 18683_procanthi.pdf ( ) (Open Access)27 p

    Risk management for high tech systems

    No full text
    Item does not contain fulltextFormaliSE '18: 6th Conference on Formal Methods in Software Engineering, Gothenburg, Sweden — June 02 - 02, 201

    Gambling for leadership : verification of root contention in IEEE 1394

    Get PDF
    Contains fulltext : 18759_gambfolev.pdf ( ) (Open Access)33 p

    A certain risk: quantitative risk management for high-tech systems

    Get PDF
    Contains fulltext : 197904.pdf (publisher's version ) (Open Access)Rede uitgesproken bij de aanvaarding van het ambt van hoogleraar Quantitative Risk Assessment of Software Systems aan de Faculteit der Natuurwetenschappen, Wiskunde en Informatica, 22 november 201848 p

    Compositionality for probabilistic automata

    No full text
    We establish that on the domain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder
    corecore